(Hyper)Graph Embedding and Classification via Simplicial Complexes
نویسندگان
چکیده
منابع مشابه
Hardness of embedding simplicial complexes in Rd
Let EMBEDk→d be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into Rd? Known results easily imply polynomiality of EMBEDk→2 (k = 1, 2; the case k = 1, d = 2 is graph planarity) and of EMBEDk→2k for all k ≥ 3. We show that the celebrated result of Novikov on the algorithmic unsolvability of reco...
متن کاملEmbedding graphs into two-dimensional simplicial complexes
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C . This problem includes, among others, the embeddability problem of a graph on a surface and the topological crossing number of a graph, but is more general. The problem is NP-complete when C is part of the input, and we give a polynomial-time algorithm if the ...
متن کاملHardness of embedding simplicial complexes in R
Let EMBEDk→d be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding ofK into R? Known results easily imply polynomiality of EMBEDk→2 (k = 1, 2; the case k = 1, d = 2 is graph planarity) and of EMBEDk→2k for all k ≥ 3 (even if k is not considered fixed). We show that the celebrated result of Novikov on the...
متن کاملUnsupervised Feature Selection Via Hypergraph Embedding
Most existing feature selection methods focus on ranking individual features based on a utility criterion, and select the optimal feature set in a greedy manner. However, the feature combinations found in this way do not give optimal classification performance, since they tend to neglect the correlations among features. In an attempt to overcome this problem, we develop a novel unsupervised fea...
متن کاملHardness of almost embedding simplicial complexes in $\mathbb R^d$
A map f : K → R of a simplicial complex is an almost embedding if f(σ) ∩ f(τ) = ∅ whenever σ, τ are disjoint simplices of K. Theorem. Fix integers d, k ≥ 2 such that d = 3k 2 + 1. (a) Assume that P 6= NP . Then there exists a finite k-dimensional complex K that does not admit an almost embedding in R but for which there exists an equivariant map K̃ → Sd−1. (b) The algorithmic problem of recognit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12110223